Perfect state transfer between two marked vertices of a graph by means ofdiscrete-time quantum walk is analyzed. We consider the quantum walk searchalgorithm with two marked vertices, sender and receiver. It is shown byexplicit calculation that for the coined quantum walks on star graph andcomplete graph with self-loops perfect state transfer between the sender andreceiver vertex is achieved for arbitrary number of vertices $N$ in$O(\sqrt{N})$ steps of the walk. Finally, we show that Szegedy's walk withqueries on complete graph allows for state transfer with unit fidelity in thelimit of large $N$.
展开▼
机译：利用离散时间量子游动分析了图的两个标记顶点之间的完美状态转移。我们考虑具有两个标记顶点（发送者和接收者）的量子行走搜索算法。通过显式计算表明，对于在任意数量的顶点$ N $ in $ O（\ sqrt {N}）$个步骤中，对于具有自环的星图和具有自环的完整图的造模量子游走，都可以实现完美的状态转移的步行。最后，我们证明了塞格迪在完整图形上的步行查询允许在大$ N $的范围内以单位保真度进行状态转移。
展开▼
